Addendum to Vertex Adjacencies in the Set Covering Polyhedron
نویسنده
چکیده
We study the relationship between the vertices of an up-monotone polyhedron and those of the polytope obtained by truncating it with the unit hypercube. When the original polyhedron has binary vertices, we characterize the vertices of the truncated polytope in terms of the original vertices, prove their integrality, and show the equivalence of adjacencies in either polyhedron. We conclude by applying our findings to settle a claim in the original paper.
منابع مشابه
Finding Compact L. R. Nackman
Practical solid modeling systems are plagued by numerical problems that arise from using floating-point arithmetic. For example, polyhedral solids are often represented by a combination of geometric and combinatorial information. The geometric information may consist of explicit plane equations, with floatingpoint coefficients; the combinatorial information may consist of face, edge, and vertex...
متن کاملApproximation Algorithms for Partial Covering Problems (submission to Icalp 2001, Track A)
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example , in k-set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approxima...
متن کاملCharacterizing Noninteger Polyhedra with 0-1 Constraints
We characterize when the intersection of a set-packing and a set-covering polyhedron or of their corresponding minors has a noninteger vertex. Our result is a common generalization of Lovász’s characterization of ‘imperfect’ and Lehman’s characterization of ‘nonideal’ systems of inequalities, furthermore, it includes new cases in which both types of inequalities occur and interact in an essenti...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملBounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کامل